Axiomatizing Propositional Dependence Logics
نویسندگان
چکیده
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled calculi.
منابع مشابه
Propositional logics of dependence
In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well as propositional inquisitive logic, are expressively complete and have disjunctive or conjunctive normal forms. We provide deduction systems and prove the com...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOn Quantified Propositional Logics and the Exponential Time Hierarchy
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the e...
متن کاملStructural completeness in propositional logics of dependence
In this paper we prove that three of the main propositional logics of dependence are structurally complete with respect to a class of substitutions under which the logics are closed. As these logics are not structural, the notions of admissibility and structural completeness have to be considered relative to classes of substitutions with respect to which they are, as we do in this paper. Depend...
متن کاملThe Entailment Problem in Modal and Propositional Dependence Logics
We examine the entailment problem for different modal and propositional dependence logics defined in terms of dependence, independence, or inclusion atoms. We establish numerous new complexity results, and settle a long-standing open question by showing that the validity problem for modal dependence logic is NEXPTIME-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015